import java.util.ArrayList;
import java.util.Arrays;
import java.util.PriorityQueue;
import java.util.TreeSet;

public class Test {
}
interface Com{
    int M=200;
    int f();
}
class ImpCom implements Com{
    public int f(){ return 100+M;}

    //public double f(){ return 2.6;}
    public static void main(String[] args) {
//        ImpCom impCom = new ImpCom();
//        System.out.println(impCom.f());
        char myChar = 'g';
        String myStr = Character.toString(myChar);
        System.out.println("String is: "+myStr);
    }
}
class ThisTest {
    public static void main(String args[]) {
        String x="7";
        int y = 2;
        int z = 2;
        System.out.println(y+x+z);
    }
}
class A {
    private String a = "aa";

    public boolean methodB() {
        String b = "bb";
        final String c = "cc";
        return true;
    }

    public static void main(String[] args) {
        TreeSet<Integer> set = new TreeSet<Integer>();
        TreeSet<Integer> subSet = new TreeSet<Integer>();
        for(int i=606;i<613;i++){
            if(i%2==0){
                set.add(i);
            }
        }
        subSet = (TreeSet)set.subSet(608,true,611,true);
        set.add(609);
        System.out.println(set+" "+subSet);
    }
}